Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases
نویسنده
چکیده
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable models, are not given up. The proposed algorithms exploit the structural information of defeasible knowledge bases to facilitate efficient computational models.
منابع مشابه
An Argumentation-Based Negotiation for Distributed Extended Logic Programs
The paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules of a logic program are viewed as encoding arguments of an agent, and the meaning of the program is determined by those arguments that somehow (depending on the specific semantics) can defend themselves from the attacks of othe...
متن کاملTaking the A-chain: Strict and Defeasible Implication in Argumentation Frameworks
Abstract Argumentation Frameworks (AFs) have proved a very fruitful basis for the exploration of the semantics of acceptability of sets of arguments as well as related complexity questions. However, applications of AFs are often held to require that arguments be given a more concrete instantiation. One popular method of instantiation is to postulate a knowledge base comprising facts and rules (...
متن کاملA Protege Plug-in for Defeasible Reasoning
We discuss two approaches for defeasible reasoning in Description Logics that allow for the statement of defeasible subsumptions of the form “α subsumed by β usually holds”. These approaches are known as prototypical reasoning and presumptive reasoning and are both rooted in the notion of Rational Closure developed by Lehmann and Magidor for the propositional case. Here we recast their definiti...
متن کاملRP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics
In this paper we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (nonbinary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main charact...
متن کاملPruning Search Space in Defeasible Argumentation
Defeasible argumentation has experienced a considerable growth in AI in the last decade. Theoretical results have been combined with development of practical applications in AI & Law, CaseBased Reasoning and various knowledge-based systems. However, the dialectical process associated with inference is computationally expensive. This paper focuses on speeding up this inference process by pruning...
متن کامل